Performance Analysis of a Threshold-Based Relay Selection Algorithm in Wireless Networks
نویسندگان
چکیده
Relay selection is an effective method to realize the cooperative diversity gain in wireless networks. In this paper, we study a threshold-based single relay selection algorithm. A reasonable threshold value is set at each relay node, and the first relay with the instantaneous channel gain larger than the threshold will be selected to cooperate with the source. The exact and closed form expression for its outage probability is derived over independent, non-identically distributed (i.n.i.d) Rayleigh channels. The complexity of the algorithm is also analyzed in detail. Simulation results are presented to verify our theoretical analysis.
منابع مشابه
Performance Analysis of Wireless Cooperative Networks with Iterative Incremental Relay Selection
In this paper, an iterative incremental relay selection (IIRS) scheme is considered for wireless cooperative networks in order to increase the reliability of transmission. Different from the conventional incremental relay selection which incrementally selects a best relay for only one iteration; the IIRS scheme iteratively applies the incremental relaying and relay selection processes. To evalu...
متن کاملHYREP: A Hybrid Low-Power Protocol for Wireless Sensor Networks
In this paper, a new hybrid routing protocol is presented for low power Wireless Sensor Networks (WSNs). The new system uses an integrated piezoelectric energy harvester to increase the network lifetime. Power dissipation is one of the most important factors affecting lifetime of a WSN. An innovative cluster head selection technique using Cuckoo optimization algorithm has been used in the desig...
متن کاملRateless Coding over Wireless Relay Networks Using Amplify/Decode and Forward Relays
In this paper two different rateless transmissionschemes are developed. In the proposed scheme, relay node candecode and forward the message to the destination if they areable to decode it, or amplify and forward the message to thedestination. Based on the analysis and simulation resultsprovided in this paper, the proposed method has bettertransmission time than the scheme which only the relay ...
متن کاملAn Adaptive LEACH-based Clustering Algorithm for Wireless Sensor Networks
LEACH is the most popular clastering algorithm in Wireless Sensor Networks (WSNs). However, it has two main drawbacks, including random selection of cluster heads, and direct communication of cluster heads with the sink. This paper aims to introduce a new centralized cluster-based routing protocol named LEACH-AEC (LEACH with Adaptive Energy Consumption), which guarantees to generate balanced cl...
متن کاملAn Efficient Cluster Head Selection Algorithm for Wireless Sensor Networks Using Fuzzy Inference Systems
An efficient cluster head selection algorithm in wireless sensor networks is proposed in this paper. The implementation of the proposed algorithm can improve energy which allows the structured representation of a network topology. According to the residual energy, number of the neighbors, and the centrality of each node, the algorithm uses Fuzzy Inference Systems to select cluster head. The alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Communications and Network
دوره 2 شماره
صفحات -
تاریخ انتشار 2010